New results on rendezvous search on the interval

In a rendezvous search problem, two players are placed in a network and must try to meet each other in the least possible expected time. We look at rendezvous search on a discrete interval in which the players are initially placed using independent draws (usually assumed to be from the same distribution). Some optimal solutions are known if this distribution is uniform, and also for certain other special types of distribution. In this article, we present two new results. First, we characterize the complete set of solutions for the uniform case, showing that all optimal strategies must have two specific properties (namely, of being swept and strictly geodesic). Second, we relate search strategies on the interval to proper binary trees, and use this correspondence to derive a recurrence relation for solutions to the symmetric rendezvous problem for any initial distribution. This relation allows us to solve any such problem computationally by dynamic programming. Finally, some ideas for future research are discussed. © Wiley Periodicals, Inc. Naval Research Logistics 60: 454–467, 2013     

The graph association problem: Mathematical models and a lagrangian heuristic

Graph association is the problem of merging many graphs that collectively describe a set of possibly repetitive entities and relationships into a single graph that contains unique entities and relationships. As a form of data association, graph association can be used to identify when two sensors are observing the same object so information from both sensors can be combined and analyzed in a meaningful and consistent way. Graph association between two graphs is related to the problem of graph matching, and between multiple graphs it is related to the common labeling of a graph set (also known as multiple graph matching) problem. This article contribution is to formulate graph association as a binary linear program and introduce a heuristic for solving multiple graph association using a Lagrangian relaxation approach to address issues with between‐graph transitivity requirements. The algorithms are tested on a representative dataset. The developed model formulation was found to accurately solve the graph association problem. Furthermore, the Lagrangian heuristic was found to solve the developed model within 3% of optimal on many problem instances, and found better solutions to large problems than is possible by directly using CPLEX. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

一种新闻事件演化建模方法

为了准确地发现话题中事件间的潜在关系,提出一种新闻事件演化建模方法。该方法利用事件的时间关系、内容相似性、命名实体关联信息构建新的演化关系模型,并通过定义事件的五种演化模式,识别出演化过程中的开始、中间、结束事件,最后根据新演化模型及演化模式建立事件演化的有向无环图模型,揭示事件发展的潜在脉络结构。实验结果表明,本文方法能够有效检测事件演化,提升系统性能。     

一种新的导弹发射技术辅助决策系统架构

导弹武器系统特有的作战特点,以及专家知识的不完备性,使得传统的辅助决策系统难以在短时间内作出准确、有效的决策。因此,提出一种新的导弹发射技术辅助决策系统的总体结构及实现相应功能的模型,即采用BP神经网络-遗传算法(GA)实现辅助决策,基于有向图实现故障诊断,通过决策融合生成图形决策方案,缩短了决策时间,提高了决策的有效性。     

具有正交(g,f)-因子分解的子图

设G是一个图 ,g (x)和f (x)是定义在V (G)上的整数值函数 ,且对任意的x∈V (G) ,设g (x)≤f (x) ,H是G的一个子图 ,F ={F1,F2 ,… ,Ft}是G的一个因子分解 ,如果对任意的 1≤i≤t,|E (H)∩E (Fi) |=1 ,则称F与H正交。闫桂英和潘教峰在文 [3]中提出如下猜想 :设G是一个 (mg+k,mf-k) -图 ,1≤k相似文献   

二部图的(g,f)匹配

本文证明了二部图存在(g,f)匹配和f 因子的充要条件以及有关的几个结果,并且给出了求二部图的最大(g,f)匹配、最小(g,f)匹配和最小权最大f 匹配、最小权(g,f)匹配、最大权(g,f)匹配的算法。     

基于节点选择更新的简化LDPC译码算法

文中通过分析信息在短环中传递的特性,提出了一种基于节点选择更新的简化LDPC译码算法。该算法可以通过在一定程度上避免短环对译码的影响来降低译码运算复杂度。仿真结果表明对于二元以及多元LDPC码,该算法相对于BP算法只有少量性能损失。     

一种面向虚拟维修训练的拆装序列描述方法

通过分析机电产品的维修特点、虚拟维修训练的需求以及产品维护规程的结构特点,提出了一种采用树型和有向图混合结构来统一描述产品维护规程和拆卸安装序列的方法,并以Visual C++/MFC为工具,开发了维护规程控件,解决了虚拟维修训练中产品维护规程和拆卸安装序列的同步直观显示、约束关系解算、规程文件存取等问题,并为维护规程的可视化编辑提供了工具。实践表明,该方法满足虚拟维修训练对维护规程和拆装序列的描述要求。     

一种基于图论的网络安全分析方法研究

随着信息技术安全问题的日益突出,对网络系统进行安全分析日益重要.提出了一种基于图论的网络安全分析方法NEG-NSAM,在进行网络参数抽象和脆弱性关联分析的基础上,构造网络渗透图模型,刻画了威胁主体逐步渗透安全目标的动态过程.针对大规模网络环境,提出了渗透图简化算法.最后,运用NEG-NSAM方法进行了实例分析,验证该方法的可行性和有效性.     

微机械陀螺品质因数的在线测量方法

品质因数是决定微机械陀螺结构性能的重要参数。传统测量振动结构品质因数的幅频曲线半功率带宽法需要记录大量幅频响应数据并需作离线处理,测量效率很低。通过分析微机械陀螺动力学模型发现,品质因数可根据谐振频率及相频函数在谐振频率点处的一阶导数值计算,且相频曲线在谐振频率点附近近似为线性。利用这些特点,提出一种新的品质因数在线快速测量方法。首先,在谐振频率附近对陀螺进行激励,得到相频数据;然后,使用递推最小二乘法估计出相频曲线斜率;最后根据该斜率和谐振频率值计算出品质因数。新方法不需要存储和离线分析频率响应数据,可以自动确定品质因数。仿真和实验验证了本文方法的正确性和可行性。